Theory of Rule 6 and its Application to Round Robin Tournament
نویسندگان
چکیده
In this paper we have used one 2 variable Boolean function called Rule 6 to define another beautiful transformation named as Extended Rule-6. Using this function we have explored the algebraic beauties and its application to an efficient Round Robin Tournament (RRT) routine for 2 (k is any natural number) number of teams. At the end, we have thrown some light towards any number of teams of the form n where n, k are natural numbers. KeywordsBoolean functions, fractals, Round-Robin Tournament, Carry value Transformation, Extended Rule 6, and Analogous rule 6.
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملEfficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کاملScheduling double round-robin tournaments with divisional play using constraint programming
We propose a tournament format that extends a traditional double round-robin format with divisional single round-robin tournaments. Elitserien, the top Swedish handball league, uses such a format for its league schedule. We introduce a constraint programming model that characterizes the general double round-robin plus divisional single round-robin format. This integrated model allows scheduling...
متن کاملCS364A: Algorithmic Game Theory Lecture #1: Introduction and Examples
We begin with a cautionary tale. In 2012, the Olympics were held in London. One of the biggest scandals of the event concerned, of all sports, women’s badminton. The scandal did not involve any failed drug tests, but rather a failed tournament design that did not carefully consider incentives. The tournament design that was used is familiar from the World Cup soccer. There are four groups (A,B,...
متن کاملConstructive Algorithms for the Constant Distance Traveling Tournament Problem
In this abstract, we deal with the Constant Distance Traveling Tournament Problem (CDTTP) [4], which is a special class of the Traveling Tournament Problem (TTP), established by Easton, Nemhauser and Trick [1]. We propose a lower bound of the optimal value of CDTTP, and two algorithms that produce feasible solutions whose objective values are close to the proposed lower bound. For some size of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0906.5450 شماره
صفحات -
تاریخ انتشار 2009